An Introduction to Spectral Graph Theory
نویسنده
چکیده
Spectral graph theory is the study of properties of the Laplacian matrix or adjacency matrix associated with a graph. In this paper, we focus on the connection between the eigenvalues of the Laplacian matrix and graph connectivity. Also, we use the adjacency matrix of a graph to count the number of simple paths of length up to 3.
منابع مشابه
Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملGraphs, Vectors, and Matrices
This survey accompanies the Josiah Williard Gibbs Lecture that I gave at the 2016 Joint Mathematics Meetings. It provides an introduction to three topics: algebraic and spectral graph theory, the sparsification of graphs, and the recent resolution of the Kadison–Singer Problem. The first and third are connected by the second.
متن کاملLectures on Spectral Graph Theory
Contents Chapter 1. Eigenvalues and the Laplacian of a graph 1 1.1. Introduction 1 1.2. The Laplacian and eigenvalues 2 1.3. Basic facts about the spectrum of a graph 6
متن کاملMAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 20: Introduction to Spectral Graph Theory–III. Graph Cut and Cheeger Constants, Isospectral Graphs, and Discrete Laplacian Eigenvalue Problems
Example 1.2. In Figure 1, S is the set of dark nodes, and the dotted lines form ∂S. S ∆ = V \S. Also, vol(S) = m(S) ∆ = x∈S m(x).
متن کامل